A space-efficient Huffman decoding algorithm and its parallelism

Ternary Tree and Memory-Efficient Huffman Decoding Algorithm

In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of ...

An efficient decoding technique for Huffman codes

We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...

Hardware Implementation of A Power Efficient Huffman Decoding

Data compression plays an important role in multimedia communication. A major compression technique is performed by converting the fixed-length codes to variable-length codes. Huffman coding is demonstrated to be a very efficient coding scheme and has been widely adopted. However, the variable-length codes increase the difficulties of fast decoding. In addition, the variable decoding time is no...

A fast algorithm for Huffman decoding based on a recursion Huffman tree

Modified Huffman Algorithm for Image Encoding and Decoding

Lossless compression of a progression of symbols is a decisive part of data and signal compression. Huffman coding is lossless in nature; it is also generally utilized in lossy compression as the eventual step after decomposition and quantization of a signal. In signal compression, the disintegration and quantization part seldom manages to harvest a progression of completely autonomous symbols....